• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) °³¼±µÈ ÀÚµ¿Á¤¸®Áõ¸í±â¹ý¿¡ ±âÃÊÇÑ À¯ÇÑü»óÀÇ µðÁöÅÐ³í¸®½Ã½ºÅÛ ±¸¼º
¿µ¹®Á¦¸ñ(English Title) Construction of the Digital logic Systems based on the Improved Automatic Theorem Proving Techniques over Finite Fields
ÀúÀÚ(Author) ¹ÚÃá¸í   Chun-Myoung Park  
¿ø¹®¼ö·Ïó(Citation) VOL 10 NO. 10 PP. 1773 ~ 1778 (2006. 10)
Çѱ۳»¿ë
(Korean Abstract)
º» ³í¹®¿¡¼­´Â °³¼±µÈ ÀÚµ¿Á¤¸®Áõ¸í±â¹ý¿¡ ±âÃÊÇÏ¿© À¯ÇÑü»óÀÇ µðÁöÅÐ³í¸®½Ã½ºÅÛÀ» ±¸¼ºÇÏ´Â ¹æ¹ýÀ» Á¦¾ÈÇÏ¿´´Ù. Á¦¾ÈÇÑ ¹æ¹ýÀ» ¸ÕÀú À¯ÇÑü»óÀÇ Áß¿äÇÑ ¼öÇÐÁ¤ ¼ºÁúÀ» ³íÀÇÇÏ¿´°í ÀÚµ¿Á¤¸®Áõ¸í±â¹ýÀÇ °³³ä°ú ±âº» ¼ºÁúÀ» ¼­¼úÇÏ¿´´Ù. ±×¸®°í °³¼±µÈ ÀÚµ¿Á¤¸®Áõ¸í±â¹ýÀ» Àû¿ëÇϱâ À§ÇØ ¸î°¡Áö Á¤ÀǸ¦ ÇÏ¿´À¸¸ç À̸¦ ±Ù°£À¸·Î µðÁöÅÐ ³í¸®½Ã½ºÅÛÀÇ Building BlockÀ» Á¦¾ÈÇÏ¿´´Ù. ¶ÇÇÑ, µðÁöÅÐ ³í¸®½Ã½ºÅÛÀ» ±¸¼ºÇϱâ À§ÇÑ Áß¿äÇÑ °ü°è¸¦ Á¤ÀÇÇÏ¿´À¸¸ç ÃÖÁ¾ À¯ÇÑü»óÀÇ µðÁöÅÐ³í¸®½Ã½ºÅÛÀ» °³¼±µÈ ÀÚµ¿Á¤¸®Áõ¸í±â¹ý¿¡ ÀÇÇØ ±¸¼ºÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
This paper propose the method of constructing the Digital Logic Systems based on the Improved Automatic Theorem Proving Techniques(IATP) over Finite Fields. The proposed method is as following. First, we discuss the background and the important mathematical propertied for Finite Fields. Also, we discuss the concepts of the Automatic Theorem Proving Techniques(ATP) including the syntactic method and semantic method, and discuss the basic properties for the ATP, In this step, we define several definitions of the IATP, Table Pseudo Function Tab and Equal. Next, we propose the T-gate as Building Block(BB) and describe the mathematical representation for the notation of T-gate. Then we discuss the important properties for the T-gate. Also, we propose the several relationships that are Identity relationship, Constant relationship, Tautology relationship and Mod R cyclic relationship. Then we propose Mod R negation gate and the manipulation of the don't are conditions. Finally, we propose the algorithm for the constructing the method of the digital logic systems over finite fields. The proposed method is more efficiency and regularity than any other earlier methods. Then, we prospect the futere research and prospects.
Å°¿öµå(Keyword) Finite Fields   Automatic Theorem Proving Techniques   Digital Logic Systems   Building Block etc.  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå